Three-objective subgraph mining using multiobjective evolutionary programming

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Three-objective subgraph mining using multiobjective evolutionary programming

Article history: Received 1 August 2012 Received in revised form 16 November 2012 Accepted 14 March 2013 Available online xxxx

متن کامل

A multiobjective evolutionary programming framework for graph-based data mining

Subgrap h mining is the process of identifying concep ts describing interesting and repetitive subgraphs within graph-based data. The exponential number of possible subgraphs makes the problem very challenging. Existing methods apply a single-objective subgraph search with the view that interesting subgraphs are those capable of not merely compressing the data, but also enhancing the interpreta...

متن کامل

Objective Reduction in Evolutionary Multiobjective Optimization

Many-objective problems represent a major challenge in the field of evolutionary multiobjective optimization—in terms of search efficiency, computational cost, decision making, visualization, and so on. This leads to various research questions, in particular whether certain objectives can be omitted in order to overcome or at least diminish the difficulties that arise when many, that is, more t...

متن کامل

Solving multiobjective linear programming problems using ball center of polytopes

Here‎, ‎we aim to develop a new algorithm for solving a multiobjective linear programming problem‎. ‎The algorithm is to obtain a solution which approximately meets the decision maker's preferences‎. ‎It is proved that the proposed algorithm always converges to a weak efficient solution and at times converges to an efficient solution‎. ‎Numerical examples and a simulation study are used to illu...

متن کامل

Data Mining Rules Using Multi-Objective Evolutionary Algorithms

In data mining, nugget discovery is the discovery of interesting classification rules that apply to a target class. In previous research, heuristic methods (Genetic algorithms, Simulated Annealing and Tabu Search) have been used to optimise a single measure of interest. This paper proposes the use of multiobjective optimisation evolutionary algorithms to allow the user to interactively select a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 2014

ISSN: 0022-0000

DOI: 10.1016/j.jcss.2013.03.005